Drawing Recurrent Hierarchies

Drawing Recurrent Hierarchies

Directed graphs are generally drawn as level drawings using the hierarchical approach. Such drawings are constructed by a framework of algorithms which operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles should be displayed as such, e. g., distinguished cycles in the biosciences and scheduling processes repe...

Commentary on Perrin - Drawing Networks from Recurrent Polysemies

Recurrent Transition Hierarchies for Continual Learning: A General Overview

Continual learning is the unending process of learning new things on top of what has already been learned (Ring 1994). Temporal Transition Hierarchies (TTHs) were developed to allow prediction of Markov-k sequences in a way that was consistent with the needs of a continual-learning agent (Ring 1993). However, the algorithm could not learn arbitrary temporal contingencies. This paper describes R...

Latency-Based Probabilistic Information Processing in Recurrent Neural Hierarchies

In this article, we present an original neural space/latency code, integrated in a multi-layered neural hierarchy, that offers a new perspective on probabilistic inference operations. Our work is based on the dynamic neural field paradigm that leads to the emergence of activity bumps, based on recurrent lateral interactions, thus providing a spatial coding of information. We propose that latera...

Politeness Orientation in Social Hierarchies in Urdu

The present research is aimed at investigating how the politeness of the speakers of Urdu is influenced by their relative social status in society. The researcher took politeness theory of Brown and Levinson (1978, 1987) as a model. To observe politeness of Urdu speakers, speech act of apology with different strategies was selected. A Discourse Completion Task (DCT) was used as an instrument to...